Recursively arbitrarily vertex-decomposable graphs
نویسندگان
چکیده
منابع مشابه
Recursively arbitrarily vertex-decomposable graphs
A graph G = (V,E) is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to |V |, there is a sequence of vertex-disjoint subsets of V whose orders are given by τ , and which induce connected graphs. The main aim of this paper is to study the recursive version of this problem. We present a solution for trees, suns, and partially for a class of 2-connected graphs ...
متن کاملRecursively Arbitrarily Vertex-decomposable Suns
A graph G = (V,E) is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to |V |, there is a sequence of vertex-disjoint subsets of V whose orders are given by τ , and which induce connected graphs. The aim of this paper is to study the recursive version of this problem on a special class of graphs called suns. This paper is a complement of [O. Baudon, F. Gilber...
متن کاملDense Arbitrarily Vertex Decomposable Graphs
A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n1, . . . , nk) of positive integers such that n1 + · · · + nk = n there exists a partition (V1, . . . , Vk) of the vertex set of G such that for each i ∈ {1, . . . , k}, Vi induces a connected subgraph of G on ni vertices. The main result of the paper reads as follows. Suppose that G is a connected graph o...
متن کاملA note on arbitrarily vertex decomposable graphs
A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n1, ..., nk) of positive integers such that n1 + ... + nk = n there exists a partition (V1, ..., Vk) of the vertex set of G such that for each i ∈ {1, ..., k}, Vi induces a connected subgraph of G on ni vertices. In this paper we show that if G is a two-connected graph on n vertices with the independence nu...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2012
ISSN: 1232-9274
DOI: 10.7494/opmath.2012.32.4.689